Lagrangian relaxation for SVM feature selection

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lagrangian relaxation for SVM feature selection

We discuss a Lagrangian-relaxation-based heuristics for dealing with feature selection in a standard L1 norm Support Vector Machine (SVM) framework for binary classification. The feature selection model we adopt is a Mixed Binary Linear Programming problem and it is suitable for a Lagrangian relaxation approach. Based on a property of the optimal multiplier setting, we apply a consolidated nons...

متن کامل

Feature Selection using PSO-SVM

method based on the number of features investigated for sample classification is needed in order to speed up the processing rate, predictive accuracy, and to avoid incomprehensibility. In this paper, particle swarm optimization (PSO) is used to implement a feature selection, and support vector machines (SVMs) with the one-versus-rest method serve as a fitness function of PSO for the classificat...

متن کامل

On Lagrangian Relaxation and Subset Selection Problems

We prove a general result demonstrating the power of Lagrangian relaxation in solving constrained maximization problems with arbitrary objective functions. This yields a unified approach for solving a wide class of subset selection problems with linear constraints. Given a problem in this class and some small ε ∈ (0, 1), we show that if there exists a ρ-approximation algorithm for the Lagrangia...

متن کامل

Lagrangian Relaxation Method for the Step fixed-charge Transportation Problem

In this paper, a step fixed charge transportation problem is developed where the products are sent from the sources to the destinations in existence of both unit and step fixed-charges. The proposed model determines the amount of products in the existing routes with the aim of minimizing the total cost (sum of unit and step fixed-charges) to satisfy the demand of each customer. As the problem i...

متن کامل

Saddle Point Feature Selection in Svm Classification

SVM wrapper feature selection method for the classification problem, introduced in our previous work [1], is analyzed. The method based on modification of the standard SVM criterion by adding to the basic objective function a third term, which directly penalizes a chosen set of variables. The criterion divides the set of all variables into three subsets: deleted, selected and weighted features....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Operations Research

سال: 2017

ISSN: 0305-0548

DOI: 10.1016/j.cor.2017.06.001